A Distributed Algorithm for All Best Swap Edges
نویسندگان
چکیده
Communication in networks suffers if a link fails. When the links are edges of a tree that has been chosen from an underlying graph of all possible links, a broken link even disconnects the network. Most often, the link is restored rapidly. A good policy to deal with this sort of transient link failures is swap rerouting, where the temporarily broken link is replaced by a single swap link from the underlying graph. A rapid replacement of a broken link by a swap link is only possible if all swap links have been precomputed. The selection of high quality swap links is essential; it must follow the same objective as the originally chosen communication subnetwork. We are interested in a minimum diameter tree in a graph with edge weights (so as to minimize the maximum travel time of messages). Hence, each swap link must minimize (among all possible swaps) the diameter of the tree that results from swapping. We propose a distributed algorithm that efficiently computes all of these swap links, and we explain how to route messages across swap edges with a compact routing scheme. ∗We gratefully acknowledge the support of the Swiss SBF under contract no. C05.0047 within COST-295 (DYNAMO) of the European Union and the support of the “Natural Sciences and Engineering Research Council of Canada”.
منابع مشابه
Linear Time Distributed Swap Edge Algorithms
In this paper, we consider the all best swap edges problem in a distributed environment. We are given a 2-edge connected positively weighted networkX, where all communication is routed through a rooted spanning tree T of X. If one tree edge e = {x, y} fails, the communication network will be disconnected. However, since X is 2-edge connected, communication can be restored by replacing e by non-...
متن کاملComputing All Best Swaps for Minimum-Stretch Tree Spanners
In a densely connected communication network, represented by a graph G with non-negative edge weights, it is often advantageous to route all communication on a sparse spanning subnetwork, typically a spanning tree of G. To avoid a large communication overhead, we consider a spanning tree T of G which guarantees that for any two nodes, their distance in T is at most k times their distance in G, ...
متن کاملAuthor's Personal Copy Computing All the Best Swap Edges Distributively
Recently great attention has been given to point-of-failure swap rerouting, an efficient technique for routing in the presence of transient failures. According to this technique, a message follows the normal routing table information unless the next hop has failed; in this case, it is redirected towards a precomputed link, called swap; once this link has been crossed, normal routing is resumed....
متن کاملComputing Best Swaps in Optimal Tree Spanners
In a densely connected communication network, represented by a graph G with nonnegative edge-weights, it is often advantageous to route all communication on a sparse, spanning subnetwork, typically a spanning tree of G. With the communication overhead in mind, we consider a spanning tree T of G which guarantees that for any two nodes, their distance in T is at most k times their distance in G, ...
متن کاملAn Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
A tree σ-spanner of a positively real-weighted n-vertex and m-edge undirected graph G is a spanning tree T of G which approximately preserves (i.e., up to a multiplicative stretch factor σ) distances in G. Tree spanners with provably good stretch factors find applications in communication networks, distributed systems, and network design. However, finding an optimal or even a good tree spanner ...
متن کامل